翻訳と辞書 Words near each other ・ Smasponen Nunatak ・ Smast ・ Smaszew ・ Smaszków ・ SMAT ・ Smatchet ・ SMath Studio ・ Smathers ・ Smathers Beach ・ Smatind Peak ・ SMATV ・ SMAUG ・ Smaug ・ Smaug (genus) ・ SMAW ・ SMAWK algorithm ・ Smax ・ Smaïl Diss ・ Smaïl Khaled ・ Smaïn ・ Smażyno ・ Smažený sýr ・ Smaїl Chergui ・ SMB ・ SMB Adventure ・ SMB connector ・ SMB Matriculation School ・ SMB2 ・ SMB3 ・ SMBA Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク SMAWK algorithm ： ウィキペディア英語版 SMAWK algorithm The SMAWK algorithm is an algorithm for finding the minimum value in each row of an implicitly-defined totally monotone matrix. It is named after the initials of its five inventors, Peter Shor, Shlomo Moran, Alok Aggarwal, Robert Wilber, and Maria Klawe.〔.〕 For the purposes of this algorithm, a matrix is defined to be monotone if each row's minimum value occurs in a column which is equal to or greater than the column of the previous row's minimum. It is totally monotone if the same property is true for every submatrix (defined by an arbitrary subset of the rows and columns of the given matrix). Equivalently, a matrix is totally monotone if there does not exist a 2×2 submatrix whose row minima are in the top right and bottom left corners. Every Monge array is totally monotone, but not necessarily vice versa. For the SMAWK algorithm, the matrix to be searched should be defined as a function, and this function is given as input to the algorithm (together with the dimensions of the matrix). The algorithm then evaluates the function whenever it needs to know the value of a particular matrix cell. If this evaluation takes ''O''(''1''), then, for a matrix with ''r'' rows and ''c'' columns, the running time and number of function evaluations are both ''O''(''c''(1 + log(''r''/''c''))). This is much faster than the ''O''(''rc'') time of a naive algorithm that evaluates all matrix cells. The main applications of this method presented in the original paper by Aggarwal et al. were in computational geometry, in finding the farthest point from each point of a convex polygon, and in finding optimal enclosing polygons. Subsequent research found applications of the same algorithm in breaking paragraphs into lines, RNA secondary structure prediction,〔.〕 DNA and protein sequence alignment,〔.〕〔.〕 the construction of prefix codes,〔.〕 and image thresholding,〔.〕 among others. ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「SMAWK algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.